Symmetric representation of the elements of finite groups

نویسنده

  • Z. Hasan
چکیده

Many finite groups, including all finite non-abelian simple groups, can be symmetrically generated by involutions. In this paper we give an algorithm to symmetrically represent elements of finite groups and to transform symmetrically represented elements in terms of their permutation representation. In particular, we represent elements of the group U3(3) : 2, where U3(3) is the projective special unitary group of 3× 3 matrices with entries in the field F3, as a permutation on fourteen letters from the projective general linear group PGL2(7), followed by a word of length at most two in the fourteen involutory symmetric generators.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Classifying fuzzy normal subgroups of finite groups

In this paper a first step in classifying the fuzzy normalsubgroups of a finite group is made. Explicit formulas for thenumber of distinct fuzzy normal subgroups are obtained in theparticular cases of symmetric groups and dihedral groups.

متن کامل

Pairwise‎ ‎non-commuting elements in finite metacyclic $2$-groups and some finite $p$-groups

Let $G$ be a finite group‎. ‎A subset $X$ of $G$ is a set of pairwise non-commuting elements‎ ‎if any two distinct elements of $X$ do not commute‎. ‎In this paper‎ ‎we determine the maximum size of these subsets in any finite‎ ‎non-abelian metacyclic $2$-group and in any finite non-abelian $p$-group with an abelian maximal subgroup‎.

متن کامل

Concepts and Application of Three Dimensional Infinite Elements to Soil Structure-Interaction Problems

This study is concerned with the formulation of three dimensional mapped infinite elements with 1/r and 1/ decay types. These infinite elements are coupled with conventional finite elements and their application to some problems of soil structure interaction are discussed. The effeciency of the coupled finite-infinite elements formulation with respect to computational effort, data preparation a...

متن کامل

Cubic symmetric graphs of orders $36p$ and $36p^{2}$

A graph is textit{symmetric}, if its automorphism group is transitive on the set of its arcs. In this paper, we  classifyall the connected cubic symmetric  graphs of order $36p$  and $36p^{2}$, for each prime $p$, of which the proof depends on the classification of finite simple groups.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008